Dunhuang Murals’ Image Smoothing Processing Research Based on Gradient L0 Norm
نویسندگان
چکیده
منابع مشابه
Image smoothing via L0 gradient minimization
We present a new image editing method, particularly effective for sharpening major edges by increasing the steepness of transition while eliminating a manageable degree of low-amplitude structures. The seemingly contradictive effect is achieved in an optimization framework making use of L0 gradient minimization, which can globally control how many non-zero gradients are resulted in to approxima...
متن کاملImproved L0 Gradient Minimization with L1 Fidelity for Image Smoothing
Edge-preserving image smoothing is one of the fundamental tasks in the field of computer graphics and computer vision. Recently, L0 gradient minimization (LGM) has been proposed for this purpose. In contrast to the total variation (TV) model which employs the L1 norm of the image gradient, the LGM model adopts the L0 norm and yields much better results for the piecewise constant image. However,...
متن کاملThe l0-norm-based Blind Image Deconvolution: Comparison and Inspiration
Single image blind deblurring has been intensively studied since Fergus et al.’s variational Bayes method in 2006. It is now commonly believed that the blurkernel estimation accuracy is highly dependent on the pursed salient edge information from the blurred image, which stimulates numerous l0-approximating blind deblurring methods via kinds of techniques and tricks. This paper, however, focuse...
متن کاملComplex-valued sparse representation based on smoothed l0 norm
In this paper we present an algorithm for complex-valued sparse representation. In our previous work we presented an algorithm for Sparse representation based on smoothed norm. Here we extend that algorithm to complex-valued signals. The proposed algorithm is compared to FOCUSS algorithm and it is experimentally shown that the proposed algorithm is about two or three orders of magnitude faster ...
متن کاملFast Sparse Representation Based on Smoothed l0 Norm
In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum `-norm solution achieved by Linear Programming (LP). It...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Application
سال: 2016
ISSN: 2161-8801,2161-881X
DOI: 10.12677/csa.2016.67048